Witness (Delaunay) graphs
نویسندگان
چکیده
Proximity graphs are used in several areas in which a neighborliness relationship for input data sets is a useful tool in their analysis, and have also received substantial attention from the graph drawing community, as they are a natural way of implicitly representing graphs. However, as a tool for graph representation, proximity graphs have some limitations that may be overcome with suitable generalizations. We introduce a generalization, witness graphs, that encompasses both the goal of more power and flexibility for graph drawing issues and a wider spectrum for neighborhood analysis. We study in detail two concrete examples, both related to Delaunay graphs, and consider as well some problems on stabbing geometric objects and point set discrimination, that can be naturally described in terms of witness graphs.
منابع مشابه
A weak definition of Delaunay triangulation
We show that the traditional criterion for a simplex to belong to the Delaunay triangulation of a point set is equivalent to a criterion which is a priori weaker. The argument is quite general; as well as the classical Euclidean case, it applies to hyperbolic and hemispherical geometries and to Edelsbrunner’s weighted Delaunay triangulation. In spherical geometry, we establish a similar theorem...
متن کاملGeneralized Delaunay Graphs with respect to any Convex Set are Plane Graphs
We consider two types of geometric graphs on point sets on the plane based on a plane set C: one obtained by translates of C, another by positively scaled translates (homothets) of C. For compact and convex C, graphs defined by scaled translates of C, i.e., Delaunay graphs based on C, are known to be plane graphs. We show that as long as C is convex, both types of graphs are plane graphs.
متن کاملA probabilistic approach to reducing the algebraic complexity of computing Delaunay triangulations
Computing Delaunay triangulations in R involves evaluating the so-called in_sphere predicate that determines if a point x lies inside, on or outside the sphere circumscribing d+ 1 points p0, . . . , pd. This predicate reduces to evaluating the sign of a multivariate polynomial of degree d + 2 in the coordinates of the points x, p0, . . . , pd. Despite much progress on exact geometric computing,...
متن کاملConnections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to a factor depending on the cone number k and the dimension of the space. TD-Delaunay graphs, a.k.a. triangular-distance Delaunay triangulations introduced by Chew, have been shown to be plane 2-spanners of the 2D Euclid...
متن کاملCharacterizing Delaunay Graphs via Fixed Point Theorem
This paper discusses a problem for determining whether a given plane graph is a Delaunay graph, i.e., whether it is topologically equivalent to a Delaunay triangulation. There exists a theorem which characterizes Delaunay graphs and yields a polynomial time algorithm for the problem only by solving a certain linear inequality system. The theorem was proved by Rivin based on arguments of hyperbo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 44 شماره
صفحات -
تاریخ انتشار 2011